On Hermite’s problem, Jacobi–Perron type algorithms, and Dirichlet groups
نویسندگان
چکیده
A well-known result of Lagrange (1770) characterises quadratic irrationalities as those real numbers that can be written periodic continued fractions. Hermite asked in 1848 if there exists some way to write cubic periodically. To ap
منابع مشابه
On the Dirichlet problem for a Duffing type equation
Recently the classical variational problem for a Duffing type equation received again some attention. In [1], [2], [7], some variational approaches were used in order to receive the existence of solutions for both periodic and Dirichlet type boundary value problems. Mainly direct method is applied under various conditions pertaining to at most quadratic growth imposed on the nonlinear term give...
متن کاملDirichlet Duality and the Nonlinear Dirichlet Problem on Riemannian Manifolds
In this paper we study the Dirichlet problem for fully nonlinear secondorder equations on a riemannian manifold. As in our previous paper [HL4] we define equations via closed subsets of the 2-jet bundle where each equation has a natural dual equation. Basic existence and uniqueness theorems are established in a wide variety of settings. However, the emphasis is on starting with a constant coeff...
متن کاملOn Dirichlet ' S Divisor Problem
tact, whereas those for a = 0.02 imply only 25% more frequent contacts than the all-ornone hypothesis but with rather high though rapidly diminishing attack rates. 10 Schuman and Doull, Amer. Jour. Pub. Health, 30, Supplement to March, 1940, p. 21, state: "From these estimates of carrier prevalence and froni the average annual increment in Shick-negatives, an estimate may be made of the number ...
متن کاملDirichlet Duality and the Nonlinear Dirichlet Problem
We study the Dirichlet problem for fully nonlinear, degenerate elliptic equations of the form F.Hessu/ D 0 on a smoothly bounded domain b Rn. In our approach the equation is replaced by a subset F Sym.Rn/ of the symmetric n nmatrices with @F fF D 0g. We establish the existence and uniqueness of continuous solutions under an explicit geometric “F -convexity” assumption on the boundary @. We a...
متن کاملGroups, Graphs, Algorithms: The Graph Isomorphism Problem∗
Graph Isomorphism (GI) is one of a small number of natural algorithmic problems with unsettled complexity status in the P /NP theory: not expected to be NP-complete, yet not known to be solvable in polynomial time. Arguably, the GI problem boils down to filling the gap between symmetry and regularity, the former being defined in terms of automorphisms, the latter in terms of equations satisfied...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Arithmetica
سال: 2022
ISSN: ['0065-1036', '1730-6264']
DOI: https://doi.org/10.4064/aa210614-5-1